Harmonic mean similarity based quantum annealing for k-means
نویسندگان
چکیده
منابع مشابه
Variable neighbourhood search based heuristic for K-harmonic means clustering
Although there has been a rapid development of technology and increase of computation speeds, most of the real-world optimization problems still cannot be solved in a reasonable time. Some times it is impossible for them to be optimally solved, as there are many instances of real problems which cannot be addressed by computers at their present speed. In such cases, the heuristic approach can be...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملEnhancing Quantum Annealing Performance for the Molecular Similarity Problem
Quantum annealing is a promising technique which leverages quantum mechanics to solve hard optimization problems. Considerable progress has been made in the development of a physical quantum annealer, motivating the study of methods to enhance the efficiency of such a solver. In this work, we present a quantum annealing approach to measure similarity among molecular structures. Implementing rea...
متن کاملA New Soft Computing Method for K-Harmonic Means Clustering
The K-harmonic means clustering algorithm (KHM) is a new clustering method used to group data such that the sum of the harmonic averages of the distances between each entity and all cluster centroids is minimized. Because it is less sensitive to initialization than K-means (KM), many researchers have recently been attracted to studying KHM. In this study, the proposed iSSO-KHM is based on an im...
متن کاملOptimal inequalities for the power, harmonic and logarithmic means
For all $a,b>0$, the following two optimal inequalities are presented: $H^{alpha}(a,b)L^{1-alpha}(a,b)geq M_{frac{1-4alpha}{3}}(a,b)$ for $alphain[frac{1}{4},1)$, and $ H^{alpha}(a,b)L^{1-alpha}(a,b)leq M_{frac{1-4alpha}{3}}(a,b)$ for $alphain(0,frac{3sqrt{5}-5}{40}]$. Here, $H(a,b)$, $L(a,b)$, and $M_p(a,b)$ denote the harmonic, logarithmic, and power means of order $p$ of two positive numbers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2018
ISSN: 1877-0509
DOI: 10.1016/j.procs.2018.10.531